The RSA algorithm uses the congruent modulo n principle. To generate the initial key, 2 prime numbers
p and q must be chosen. It relies on the principle that given p and q are arbitrarily large,
their product, denoted by N = pq, will be even larger, but still have only p and q as prime factors.
The lack of prime patterns will result in significant computational time needed to brute force each prime
to find p and q from N.
To get the most out of this page:
- Play with the algorithm in the demo
- Read about the process in the article
- Complete the challenge using the knowledge gained from the article
